An associative operation on monogenic left distributive systems

نویسنده

  • Patrick Dehornoy
چکیده

Term substitution induces an associative operation on the free objects of any equational variety. In the case of left distributivity, the construction can be extended to any monogenic structure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implications, coimplications and left semi-uninorms on a complete lattice

In this paper, we firstly show that the $N$-dual operation of the right residual implication, which is induced by a left-conjunctive right arbitrary $vee$-distributive left semi-uninorm, is the right residual coimplication induced by its $N$-dual operation. As a dual result, the $N$-dual operation of the right residual coimplication, which is induced by a left-disjunctive right arbitrary $wedge...

متن کامل

Finite Left{distributive Algebras and Embedding Algebras

We consider algebras with one binary operation and one generator (monogenic) and satisfying the left distributive law a (b c) = (a b) (a c). One can de ne a sequence of nite left-distributive algebras An, and then take a limit to get an in nite monogenic left-distributive algebra A1. Results of Laver and Steel assuming a strong large cardinal axiom imply that A1 is free; it is open whether the ...

متن کامل

8 S ep 1 99 2 FINITE LEFT - DISTRIBUTIVE ALGEBRAS AND EMBEDDING ALGEBRAS

We consider algebras with one binary operation · and one generator (monogenic) and satisfying the left distributive law a · (b · c) = (a · b) · (a · c). One can define a sequence of finite left-distributive algebras An, and then take a limit to get an infinite monogenic leftdistributive algebra A∞. Results of Laver and Steel assuming a strong large cardinal axiom imply that A∞ is free; it is op...

متن کامل

Non-associative key establishment protocols and their implementation

We provide implementation details for non-associative key establishment protocols. In particular, we describe the implementation of non-associative key establishment protocols for all left self-distributive and all mutually left distributive systems.

متن کامل

Transfinite Braids and Left Distributive Operations

We complete Artin’s braid group B∞ with some limit points (with respect to a natural topology), thus obtaining an extended monoid where new left self-distributive operations are defined. This construction provides an effective realization for some free algebraic system involving a left distributive operation and a compatible associative product. AMS Subject classification: 20F36, 20N02 Here we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010